Ranking and selection for pairwise comparison

نویسندگان

چکیده

In many real-world applications, designs can only be evaluated pairwise, relative to each other. Nevertheless, in the simulation literature, almost all ranking and selection procedures are developed based on individual performances of design. This research considers statistical problem when design performance simulated pairwise. We formulate this new using optimal computing budget allocation approach derive asymptotic optimality condition some approximations. The numerical study indicates that our reduce number simulations required confidently identify best

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preference Learning and Ranking by Pairwise Comparison

This chapter provides an overview of recent work on preference learning and ranking via pairwise classification. The learning by pairwise comparison (LPC) paradigm is the natural machine learning counterpart to the relational approach to preference modeling and decision making. From a machine learning point of view, LPC is especially appealing as it decomposes a possibly complex prediction prob...

متن کامل

Characterization of an inconsistency ranking for pairwise comparison matrices

Pairwise comparisons between alternatives are a well-known method for incorporating preferences of a decision-maker. Since these often do not exhibit consistency, a number of inconsistency indices has been introduced in order to measure the deviation from this ideal case. We axiomatically characterize the inconsistency ranking induced by the Koczkodaj inconsistency index by presenting six indep...

متن کامل

Pairwise Preference Learning and Ranking

We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of examples with partial (and possibly inconsistent) information about their associated rankings. From these, we induce a ranking function by reducing the original problem to a number of binary classification problems, one for...

متن کامل

Efficient Pairwise Classification and Ranking

Pairwise classification is a class binarization procedure that converts a multi-class problem into a series of two-class problems, one problem for each pair of classes. While it can be shown that for training, this procedure is more efficient than the more commonly used one-against-all approach, it still has to evaluate a quadratic number of classifiers when computing the predicted class for a ...

متن کامل

On a pairwise comparison-based consistent non-numerical ranking

We discuss a consistent model of pairwise comparison-based non-numerical ranking. An algorithm that enforces consistency for raw or partially organized ranking data is presented and its properties are analysed. The concept of testing subjective rankings is also discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics

سال: 2023

ISSN: ['1520-6750', '0894-069X']

DOI: https://doi.org/10.1002/nav.22093